Finding separator cuts in planar graphs within twice the optimal - Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on
نویسندگان
چکیده
Building on the works of Reo [9, 101 and Park and Phillips [8], we present a factor 2 approximation algorithm for the problem of finding a minimum cost bbalanced cut in planar graphs, for b 5 5 , if the vertex weights are given in unary (using scaling, a psuedo-approximation algorithm is also presented for the case of binary vertex weights). This problem is of considerable practical significance, especially in VLSI design.
منابع مشابه
Finding separator cuts in planar graphs within twice the optimal
A factor 2 approximation algorithm for the problem of finding a minimum-cost bbalanced cut in planar graphs is presented, for b ≤ 1 3 . We assume that the vertex weights are given in unary; for the case of binary vertex weights, a pseudoapproximation algorithm is presented. This problem is of considerable practical significance, especially in VLSI design. The natural algorithm for this problem ...
متن کاملLayered Separators in Minor-Closed Families with Applications
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is limited by the fact that the separator can be as large as Ω( √ n) in graphs with n vertices. This is the case for planar graphs, and more generally, for proper minor-closed classes. We study a special type of graph separator, called a layered separator, which may have ...
متن کاملDecoherence and programmable quantum computation
When coherent states of the electromagnetic field are used to drive the evolution of a quantum computer, a decoherence results due to the back reaction from the qubits onto the fields. We show how to calculate this effect. No assumptions about the environment are necessary, so this represents a useful model to test the fidelity of quantum error correcting codes. We examine two cases of interest...
متن کاملStrengths and Weaknesses of Quantum Computing
Recently a great deal of attention has been focused on quantum computation following a sequence of results [Bernstein and Vazirani, in Proc. 25th Annual ACM Symposium Theory Comput., 1993, pp. 11–20, SIAM J. Comput., 26 (1997), pp. 1411–1473], [Simon, in Proc. 35th Annual IEEE Symposium Foundations Comput. Sci., 1994, pp. 116–123, SIAM J. Comput., 26 (1997), pp. 1474–1483], [Shor, in Proc. 35th...
متن کاملFast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
We study combinatorial optimization problems in which a set of distributed agents must achieve a global objective using only local information. Papadimitriou and Yannakakis [Proceedings of the 25th ACM Symposium on Theory of Computing, 1993, pp. 121–129] initiated the study of such problems in a framework where distributed decision-makers must generate feasible solutions to positive linear prog...
متن کامل